Piecewise Parametric Structure in the Pooling Problem – from Sparse Strongly-Polynomial Solutions to NP-Hardness
نویسندگان
چکیده
The standard pooling problem is a NP-hard subclass of non-convex quadraticallyconstrained optimization problems that commonly arises in process systems engineering applications. We take a parametric approach to uncovering topological structure and sparsity, focusing on the single quality standard pooling problem in its p-formulation. The structure uncovered in this approach validates Professor Christodoulos A. Floudas’ intuition that pooling problems are rooted in piecewise-defined functions. We introduce dominant active topologies under relaxed flow availability to explicitly identify pooling problem sparsity and show that the sparse patterns of active topological structure are associated with a piecewise objective function. Finally, the paper explains the conditions under which sparsity vanishes and where the combinatorial complexity emerges to cross over the P/NP boundary. We formally present the results obtained and their derivations for various specialized single quality pooling problem subclasses.
منابع مشابه
Analysis of MILP Techniques for the Pooling Problem
The pq-relaxation for the pooling problem can be constructed by applying McCormick envelopes for each of the bilinear terms appearing in the so-called pq-formulation of the pooling problem. This relaxation can be strengthened by using piecewise-linear functions that overand under-estimate each bilinear term. The resulting relaxation can be written as a mixed integer linear programming (MILP) mo...
متن کاملStrong NP-Hardness for Sparse Optimization with Concave Penalty Functions
We show that finding a global optimal solution for the regularized Lq-minimization problem (q ≥ 1) is strongly NP-hard if the penalty function is concave but not linear in a neighborhood of zero and satisfies a very mild technical condition. This implies that it is impossible to have a fully polynomial-time approximation scheme (FPTAS) for such problems unless P = NP. This result clarifies the ...
متن کاملNP-Hardness and Inapproximability of Sparse PCA
We give a reduction from clique to establish that sparse PCA is NP-hard. The reduction has a gap which we use to exclude an FPTAS for sparse PCA (unless P=NP). Under weaker complexity assumptions, we also exclude polynomial constant-factor approximation algorithms.
متن کاملA polynomially solvable case of the pooling problem
Answering a question of Haugland, we show that the pooling problem with one pool and a bounded number of inputs can be solved in polynomial time by solving a polynomial number of linear programs of polynomial size. We also give an overview of known complexity results and remaining open problems to further characterize the border between (strongly) NP-hard and polynomially solvable cases of the ...
متن کاملFast optimal and suboptimal algorithms for sparse solutions to linear inverse problems
We present two “fast” approaches to the NP-hard problem of computing a maximally sparse approximate solution to linear inverse problems, also known as best subset selection. The first approach, a heuristic, is an iterative algorithm globally convergent to sparse elements of any given convex, compact S C Wmr. We demonstrate its effectiveness in bandlimited extrapolation and in sparse filter desi...
متن کامل